Complete proof systems for weighted modal logic
نویسندگان
چکیده
منابع مشابه
Focused Labeled Proof Systems for Modal Logic
Focused proofs are sequent calculus proofs that group inference rules into alternating negative and positive phases. These phases can then be used to define macro-level inference rules from Gentzen’s original and tiny introduction and structural rules. We show here that the inference rules of labeled proof systems for modal logics can similarly be described as pairs of such negative and positiv...
متن کاملProof theory for modal logic
The axiomatic presentation of modal systems and the standard formulations of natural deduction and sequent calculus for modal logic are reviewed, together with the difficulties that emerge with these approaches. Generalizations of standard proof systems are then presented. These include, among others, display calculi, hypersequents, and labelled systems, with the latter surveyed from a closer p...
متن کاملRecent Advances in Proof Systems for Modal Logic
In recent years, a number of challenges has been faced in the proof theory of modal and related logics, especially in relation to their applications in the widening field of philosophical logic. However, as discussed in [6], uniform methods for generating analytic calculi for these logics have been developed in full generality only for normal modal logics with geometric frame conditions. On the...
متن کاملComplete Proof Systems for First Order Interval Temporal Logic
Di erent interval modal logics have been proposed for reasoning about the temporal behaviour of digital systems. Some of them are purely propositional and only enable the speci cation of qualitative time requirements. Others, such as ITL and the duration calculus, are rst order logics which support the expression of quantitative, real-time requirements. These two logics have in common the prese...
متن کاملOptimal Proof Systems for Propositional Logic and Complete Sets
A polynomial time computable function h : ! whose range is the set of tau-tologies in Propositional Logic (TAUT), is called a proof system. Cook and Reckhow deened this concept in 6] and in order to compare the relative strength of diierent proof systems, they considered the notion of p-simulation. Intuitively a proof system h p-simulates a second one h 0 if there is a polynomial time computabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.03.007